Complexity of Boolean algebras
نویسندگان
چکیده
منابع مشابه
Borel complexity of isomorphism between quotient Boolean algebras
See [Oli04]. In [AdKech00], Adams and Kechris showed that the relation of equality on Borel sets (and therefore, any Borel equivalence relation whatsoever) is Borel reducible to the equivalence relation of Borel bireducibility. (In somewhat finer terms, they showed that the partial order of inclusion on Borel sets is Borel reducible to the quasi-order of Borel reducibility.) Their technique was...
متن کاملRobbins Algebras vs. Boolean Algebras
In the early 1930s, Huntington proposed several axiom systems for Boolean algebras. Robbins slightly changed one of them and asked if the resulted system is still a basis for variety of Boolean algebras. The solution (afirmative answer) was given in 1996 by McCune with the help of automated theorem prover EQP/OTTER. Some simplified and restucturized versions of this proof are known. In our vers...
متن کاملBoolean Algebras in Visser Algebras
We generalize the double negation construction of Boolean algebras in Heyting algebras, to a double negation construction of the same in Visser algebras (also known as basic algebras). This result allows us to generalize Glivenko’s Theorem from intuitionistic propositional logic and Heyting algebras to Visser’s basic propositional logic and Visser algebras. Mathematics Subject Classification: P...
متن کاملDepth of Boolean Algebras
Suppose D is an ultrafilter on κ and λ = λ. We prove that if Bi is a Boolean algebra for every i < κ and λ bounds the Depth of every Bi, then the Depth of the ultraproduct of the Bi’s mod D is bounded by λ. We also show that for singular cardinals with small cofinality, there is no gap at all. This gives a partial answer to problem No. 12 in [?]. 2000 Mathematics Subject Classification. Primary...
متن کاملComplexity of Linear Boolean Operators Complexity of Linear Boolean Operators
How to compute a linear Boolean operator by a small circuit using only unbounded fanin addition gates? Because this question is about one of the simplest and most basic circuit models, it has been considered by many authors since the early 1950s. This has led to a variety of upper and lower bound arguments—ranging from algebraic (determinant and matrix rigidity), to combinatorial (Ramsey proper...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 1980
ISSN: 0304-3975
DOI: 10.1016/0304-3975(80)90048-1